skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Cantu, Angel A."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; ; (, Natural Computing)
    Free, publicly-accessible full text available December 13, 2025
  2. ; ; ; (, Algorithmica)
    null (Ed.)
    Full Text Available 
  3. ; ; ; ; ; (, Natural computing)
    null (Ed.)
    Accepted Manuscript Full Text Available
  4. ; ; ; (, International Symposium on Algorithms and Computation)
    Full Text Available 
  5. ; ; ; ; ; (, Canadian Conference on Computational Geometry)
    null (Ed.)
    Accepted Manuscript Full Text Available
  6. ; ; ; ; ; (, Canadian Conference on Computational Geometry)
    null (Ed.)
    Accepted Manuscript Full Text Available
  7. ; ; ; ; ; (, Journal of information processing)
    null (Ed.)
    Accepted Manuscript Full Text Available
  8. ; ; ; (, Leibniz international proceedings in informatics)
    Full Text Available 
  9. ; ; ; ; ; ; ; (, Japan Conference on Discrete and Computational Geometry, Graphs, and Games)
    In this paper, we investigate a certain class of tile-based pattern games through a simplified version of a recent game titled Nonads. We prove that Nonads is PSPACE-complete with a reduction from bounded 2-player constraint logic (Bounded 2CL) even when both players share the same target and there is only one type of playable tile. This has application to any grid-based pattern building game. 
    more » « less
    Accepted Manuscript Full Text Available